Conjugate gradient like methods and their application to fixed source neutron diffusion problems.

Application of frames in Chebyshev and conjugate gradient methods

‎Given a frame of a separable Hilbert space $H$‎, ‎we present some‎ ‎iterative methods for solving an operator equation $Lu=f$‎, ‎where $L$ is a bounded‎, ‎invertible and symmetric‎ ‎operator on $H$‎. ‎We present some algorithms‎ ‎based on the knowledge of frame bounds‎, ‎Chebyshev method and conjugate gradient method‎, ‎in order to give some‎ ‎approximated solutions to the problem‎. ‎Then we i...

Bit on Conjugate Gradient like Methods for Eigen like Problems

Numerical analysts physicists and signal processing engineers have proposed algo rithms that might be called conjugate gradient for problems associated with the com putation of eigenvalues There are many variations mostly one eigenvalue at a time though sometimes block algorithms are proposed Is there a correct conjugate gradi ent algorithm for the eigenvalue problem How are the algorithms rela...

An Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems

In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...

Multigrid-Conjugate Gradient Type Methods for Reaction-diffusion Systems

We study multigrid methods in the context of continuation methods for reaction–diffusion systems, where the Bi-CGSTAB and GMRES methods are used as the relaxation scheme for the V-cycle, W-cycle and full approximation schemes, respectively. In particular, we apply the results of Brown and Walker [1997] to investigate how the GMRES method can be used to solve nearly singular systems that occur i...

Multilevel Conjugate Gradient Methods